A Faster Fitness Calculation Method for Genetic Algorithm Based Multiple Protein Sequence Alignment
نویسندگان
چکیده
Sequence alignment is a method to establish similarity between sequences. Sometimes it is necessary to compare many sequences simultaneously to establish evolutionary relationship between them. The process of aligning multiple sequences simultaneously to achieve maximum similarity is called Multiple Sequence Alignment problem. Multiple Protein Sequence Alignment is an NP Hard problem. So there have been several attempts made to approximate the solution using genetic algorithm, where it is necessary to calculate the fitness of each chromosome in the population for every generation. In this paper we have presented a scheme that will help calculate the fitness of the chromosomes faster, thereby reducing time of the alignment process.
منابع مشابه
An Application of the ABS LX Algorithm to Multiple Sequence Alignment
We present an application of ABS algorithms for multiple sequence alignment (MSA). The Markov decision process (MDP) based model leads to a linear programming problem (LPP), whose solution is linked to a suggested alignment. The important features of our work include the facility of alignment of multiple sequences simultaneously and no limit for the length of the sequences. Our goal here is to ...
متن کاملMultiple molecular sequence alignment by island parallel genetic algorithm
This paper presents an evolution-based approach for solving multiple molecular sequence alignment. The approach is based on the island parallel genetic algorithm that relies on the fitness distribution over the population of alignments. The algorithm searches for an alignment among the independent isolated evolving populations by optimizing weighted sum of pairs objective function which measure...
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملA New Method for Color Gamut Mapping by Genetic Algorithm
To reproduce an image, it is necessary to map out of gamut colors of the image to destination gamut. It is clear that the best color gamut mapping introduces the perceptually closest image to the original one. In this study, a new color gamut mapping is purposed by the aid of Genetic Algorithm (GA). The color difference between the original and mapped images based on S-LAB formula was chosen as...
متن کاملGenetic Algorithm Based Approach for Obtaining Alignment of Multiple Sequences
This paper presents genetic algorithm based solution for determing alignment of multiple molecular sequences. Two datasets from DNA families Canis_familiaris and galaxy dataset have been considered for experimental work & analysis. Genetic operators like cross over rate, mutation rate can be defined by the user. Experiments & observations were recorded w.r.t variable parameters like fixed popul...
متن کامل